On a heterochromatic number for hypercubes
نویسندگان
چکیده
The neighbourhood heterochromatic number nhc(G) of a non-empty graphG is the smallest integer l such that for every colouring of G with exactly l colours, G contains a vertex all of whose neighbours have different colours. We prove that limn→∞(nhc(Gn)− 1)/|V (Gn)| = 1 for any connected graph G with at least two vertices. We also give upper and lower bounds for the neighbourhood heterochromatic number of the 2n-dimensional hypercube. © 2007 Elsevier B.V. All rights reserved.
منابع مشابه
Time and Bit Optimal Broadcasting on Anonymous Unoriented Hypercubes
We consider broadcasting on asynchronous anonymous totally unoriented N node hypercubes. First we generalize a technique, introduced in [3], for partial broadcasting and orientation. Using this technique we develop a broadcasting algorithm on unoriented hypercubes that uses only linear number of bits and runs in optimal time. This gives a positive answer to the question raised in [7] whether O(...
متن کاملA ug 2 01 7 On the number of proper paths between vertices in edge - colored hypercubes
Given an integer 1 ≤ j < n, define the (j)-coloring of a n-dimensional hypercube Hn to be the 2-coloring of the edges of Hn in which all edges in dimension i, 1 ≤ i ≤ j, have color 1 and all other edges have color 2. Cheng et al. [Proper distance in edge-colored hypercubes, Applied Mathematics and Computation 313 (2017) 384-391.] determined the number of distinct shortest properly colored paths...
متن کاملThe domination number of exchanged hypercubes
Exchanged hypercubes [Loh et al., IEEE Transactions on Parallel and Distributed Systems 16 (2005) 866–874] are spanning subgraphs of hypercubes with about one half of their edges but still with many desirable properties of hypercubes. Lower and upper bounds on the domination number of exchanged hypercubes are proved which in particular imply that γ(EH(2, t)) = 2 holds for any t ≥ 2. Using Hammi...
متن کاملHeterochromatic tree partition number of a complete multipartite graph
A heterochromatic tree is an edge-colored tree in which any two edges have different colors. The heterochromatic tree partition number of an r-edge-colored graph G, denoted by tr(G), is the minimum k such that whenever the edges of the graph G are colored with r colors, the vertices of G can be covered by at most k vertexdisjoint heterochromatic trees. In this paper we determine the heterochrom...
متن کاملOn the Structure of Orthogonal Latin Hypercubes
The structure of orthogonal Latin hypercubes(OLH) is established in vector space over GF(2). An upper bound on the number of columns of an OLH is given. An OLH whose number of columns reaches the upper bound are found for m = 3 and m = 4, while the cases for m 5 are still unknown.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 308 شماره
صفحات -
تاریخ انتشار 2008